On Doped SC-LDPC Codes for Streaming

نویسندگان

چکیده

In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in coupled chain. We formulate a scaling law to predict bit and block error rate periodically-doped semi-infinite SC-LDPC code ensembles streamed over binary erasure channel under sliding window decoding for given finite component length. The assumes that with some probability is equivalent full termination triggers two waves; otherwise, performs as if chain had not been doped at all. approximate use derived laws rates presence doping. proposed provides accurate predictions. further it show applications periodic can yield higher than same error-correcting performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overlapped Circular SC-LDPC Codes and Their Modified Coupled Codes

In this paper, overlapped circular spatially-coupled low-density parity-check codes (OC-LDPC) are proposed and their modified coupled codes are derived, which show better performance compared with the spatially-coupled low-density parity-check (SC-LDPC) codes. It is known that the SC-LDPC codes show asymptotically good performance when the chain length is sufficiently large. However, a large ch...

متن کامل

on the girth of tanner (3,7) quasi-cyclic ldpc codes

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

متن کامل

LDPC Codes for Discrete Integration

Discrete integration over exponentially large combinatorial sets is a key task for approximate probabilistic inference. Ermon et al. recently developed an approximation algorithm for discrete integration with provable guarantees using hashing techniques. These works reduce discrete integration to solving a polynomial number of MAP inference queries for models that include random linear parity c...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programing

In this paper, we propose a new design method of irregular spatially-coupled low-density paritycheck (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2021

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2021.3069628